BLACK HOLES, SPACE-FILLING CHAINS AND RANDOM WALKS
نویسندگان
چکیده
منابع مشابه
Black Holes, Space-Filling Chains and Random Walks
Many approaches to a semiclassical description of gravity lead to an integer black hole entropy. In four dimensions this implies that the Schwarzschild radius obeys a formula which describes the distance covered by a Brownian random walk. For the higher-dimensional Schwarzschild-Tangherlini black hole, its radius relates similarly to a fractional Brownian walk. We propose a possible microscopic...
متن کاملRandom walks and Markov chains
This lecture discusses Markov chains, which capture and formalize the idea of a memoryless random walk on a finite number of states, and which have wide applicability as a statistical model of many phenomena. Markov chains are postulated to have a set of possible states, and to transition randomly from one state to a next state, where the probability of transitioning to a particular next state ...
متن کاملMarkov Chains and Random Walks
Let G = (V,E) be a connected, undirected graph with n vertices and m edges. For a vertex v ∈ V , Γ(v) denotes the set of neighbors of v in G. A random walk on G is the following process, which occurs in a sequence of discrete steps: starting at a vertex v0, we proceed at the first step to a random edge incident on v0 and walking along it to a vertex v1, and so on. ”Random chosen neighbor” will ...
متن کاملLecture 7: Markov Chains and Random Walks
A transition probability Pij corresponds to the probability that the state at time step t+1 will be j, given that the state at time t is i. Therefore, each row in the matrix M is a distribution and ∀i, j ∈ SPij ≥ 0 and ∑ j Pij = 1. Let the initial distribution be given by the row vector x ∈ R, xi ≥ 0 and ∑ i xi = 1. After one step, the new distribution is xM. It is easy to see that xM is again ...
متن کاملDeterministic Random Walks for Rapidly Mixing Chains
The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph. Instead of distributing tokens to randomly chosen neighbors, the rotor-router deterministically serves the neighbors in a fixed order. This paper is concerned with a generalized model, functional-router model. While the rotor-router is an analogy with a random walk consisti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics A
سال: 2006
ISSN: 0217-751X,1793-656X
DOI: 10.1142/s0217751x06033982